Decomposition into open nets
نویسندگان
چکیده
We study the decomposition of an arbitrary Petri net into open nets. This means that shared places can be seen as message channels between components. We show that there exists a unique decomposition into atomic components which can be efficiently computed. We further show that every composition of components yields a component and that every component can be built from atomic components. Finally, we briefly discuss potential applications.
منابع مشابه
Compositional semantics for open Petri nets based on deterministic processe
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designated as open, represent an interface of the system towards the environment. Besides generalizing the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz-Reisi...
متن کاملNets, Sequential Components and Concurrency Relations
A lattice of unmarked nets is introduced and studied. It is proved that unmarked nets representing the static structure of sequential systems are atoms of that lattice. Marking classes defined by the decomposition of nets into sequential components are introduced and proper:+zs (safeness, fireability, etc.) of nets with those marking classes are investigated. The notion of concurrent>’ relation...
متن کاملPetri Nets, Flat Languages and Linear Arithmetic
We present a method for characterizing the least xed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying some rules of decomposition that transform general sets of computation paths into \\at" ones. We apply the method for expressing the reachability relation of Petri nets as a linear arithmetic formula in order to prove (or disprove) their sa...
متن کاملDecomposing Petri nets
In recent work, the second and third authors introduced a technique for reachability checking in 1-bounded Petri nets, based on wiring decompositions, which are expressions in a fragment of the compositional algebra of nets with boundaries. Here we extend the technique to the full algebra and introduce the related structural property of decomposition width on directed hypergraphs. Small decompo...
متن کاملEncoding Asynchronous Interactions Using Open Petri Nets
We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open places. The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment. The encoding preserves strong and we...
متن کامل